Kolmogorov Random Graphs and the Incompressibility Method
نویسندگان
چکیده
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance of the number of (possibly overlapping) ordered labeled subgraphs of a labeled graph as a function of its randomness deficiency (how far it falls short of the maximum possible Kolmogorov complexity) and (ii) a new elementary proof for the number of unlabeled graphs.
منابع مشابه
Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs Θ(n) bits are necessary and sufficient for shortest path routing. By ‘almost all graphs’ we mean the Kolmogorov random graphs which constitute a fraction of 1− 1/nc of all grap...
متن کاملKolmogorov Incompressibility Method in Formal Proofs A Critical Survey
We compare the incompressibility method of Kolmogorov complexity that is used in formal proofs of mathematical and computational results with more traditional methods such as proofs by counting, proofs by probabilistic arguments and proofs by pumping lemmas for formal languages. We consider applications of Kolmogorov complexity in several diierent areas such as lower bounds, average case analys...
متن کامل0 The Average - Case Area of Heilbronn - Type Triangles ∗
triangles with vertices chosen from among n points in the unit square, U , let T be the one with the smallest area, and let A be the area of T . Heilbronn’s triangle problem asks for the maximum value assumed by A over all choices of n points. We consider the average-case: If the n points are chosen independently and at random (uniform distribution) then there exist positive c and C such that c...
متن کاملThe Expected Size of Heilbronn's Triangles
Heilbronn’s triangle problem asks for the least ∆ such that n points lying in the unit disc necessarily contain a triangle of area at most ∆. Heilbronn initially conjectured ∆ = O(1/n). As a result of concerted mathematical effort it is currently known that there are positive constants c and C such that c logn/n ≤ ∆ ≤ C/n for every constant ǫ > 0. We resolve Heilbronn’s problem in the expected ...
متن کاملThe Incompressibility Method
Kolmogorov complexity is a modern notion of randomness dealing with the quantity of information in individual objects; that is, pointwise randomness rather than average randomness as produced by a random source. It was proposed by A.N. Kolmogorov in 1965 to quantify the randomness of individual objects in an objective and absolute manner. This is impossible for classical probability theory. Kol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 29 شماره
صفحات -
تاریخ انتشار 1999